Minimally Knotted Spatial Graphs are Totally Knotted
نویسندگان
چکیده
Applying Jaco’s Handle Addition Lemma, we give a condition for a 3-manifold to have an incompressible boundary. As an application, we show that the boundary of the exterior of a minimally knotted planar graph is incompressible.
منابع مشابه
Knotted Hamiltonian cycles in spatial embeddings of complete graphs
We show the complete graph on n vertices contains a knotted Hamiltonian cycle in every spatial embedding, for n > 7. Moreover, we show that for n > 8, the minimum number of knotted Hamiltonian cycles in every embedding of Kn is at least (n−1)(n−2) . . . (9)(8). We also prove K8 contains at least 3 knotted Hamiltonian cycles in every spatial embedding.
متن کاملA Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages
We introduce simple codes and fast visualization tools for knotted structures in molecules and neural networks. Knots, links and more general knotted graphs are studied up to an ambient isotopy in Euclidean 3-space. A knotted graph can be represented by a plane diagram or by an abstract Gauss code. First we recognize in linear time if an abstract Gauss code represents an actual graph embedded i...
متن کاملMany, Many More Intrinsically Knotted Graphs
We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.
متن کاملThe 3-move and Knotted 4-valent Graphs in 3-space
A topological graph is a one-dimensional complex consisting of finitely many 0-cells (vertices) and finitely many 1-cells (edges and loops). In [7], Kauffman proved that piecewise linear ambient isotopy of a piecewise linear embedding of a topological graph in Euclidean 3-space R3 or 3-sphere 3, referred simply a knotted graph, is generated by a set of diagrammatic local moves (see Fig. 1) that...
متن کاملAn Algorithm for Detecting Intrinsically Knotted Graphs
We describe an algorithm that recognizes seemingly most — possibly all — intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used in [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted att...
متن کامل